Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems

In a recent paper by Monteiro and Svaiter, a hybrid proximal extragradient (HPE) framework was used to study the iteration-complexity of a first-order (or, in the context of optimization, second-order) method for solving monotone nonlinear equations. The purpose of this paper is to extend this analysis to study a prox-type first-order method for monotone smooth variational inequalities and incl...

متن کامل

A modified subgradient extragradient method for solving monotone variational inequalities

In the setting of Hilbert space, a modified subgradient extragradient method is proposed for solving Lipschitz-continuous and monotone variational inequalities defined on a level set of a convex function. Our iterative process is relaxed and self-adaptive, that is, in each iteration, calculating two metric projections onto some half-spaces containing the domain is involved only and the step siz...

متن کامل

A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities

In this paper we present a primal interior-point hybrid proximal extragradient (HPE) method for solving a monotone variational inequality over a closed convex set endowed with a selfconcordant barrier and whose underlying map has Lipschitz continuous derivative. In contrast to the method of [7] in which each iteration required an approximate solution of a linearized variational inequality over ...

متن کامل

A new modified approximate proximal-extragradient type method for monotone variational inequalities

In this paper, we propose a new approximate proximal point algorithm (APPA). The proposed method uses a new searching direction which differs from the other existing APPAs. Under some mild conditions, we show that the proposed method is globally convergent. The results presented in this paper extend and improve some well-known results in the literature.

متن کامل

Convergence Analysis of a Hybrid Relaxed-Extragradient Method for Monotone Variational Inequalities and Fixed Point Problems

In this paper we introduce a hybrid relaxed-extragradient method for finding a common element of the set of common fixed points of N nonexpansive mappings and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping. The hybrid relaxed-extragradient method is based on two well-known methods: hybrid and extragradient. We derive a strong convergence ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2012

ISSN: 1052-6234,1095-7189

DOI: 10.1137/11083085x